n-level rewriting systems

Connector Rewriting with High-Level Replacement Systems

Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primitive channels with welldefined behavior. These channels are mobile, i.e. can be dynamically created and reconfigured at run-time. Based on these language features, we introduce a high-level transformation system for Re...

Sentence-level Rewriting Detection

Writers usually need iterations of revisions and edits during their writings. To better understand the process of rewriting, we need to know what has changed between the revisions. Prior work mainly focuses on detecting corrections within sentences, which is at the level of words or phrases. This paper proposes to detect revision changes at the sentence level. Looking at revisions at a higher l...

Rewriting N achum Dershowitz

Transfinite Rewriting Semantics for Term Rewriting Systems

We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...

Natural Rewriting for General Term Rewriting Systems

We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the most efficient of all being the natural rewriting strategy [9]. All the strategies so far, including natural rewriting, assume that the given term rewriting system is a left-linear constructor system. Although these rest...